Symbolic generic initial systems of star configurations
نویسندگان
چکیده
منابع مشابه
STAR CONFIGURATIONS IN Pn
Star configurations are certain unions of linear subspaces of projective space. They have appeared in several different contexts: the study of extremal Hilbert functions for fat point schemes in the plane; the study of secant varieties of some classical algebraic varieties; the study of the resurgence of projective schemes. In this paper we study some algebraic properties of the ideals defining...
متن کاملGeneric Finiteness for Dziobek Configurations
The goal of this paper is to show that for almost all choices of n masses, mi, there are only finitely many central configurations of the Newtonian n-body problem for which the bodies span a space of dimension n − 2 (such a central configuration is called a Dziobek configuration). The result applies in particular to two-dimensional configurations of four bodies and threedimensional configuratio...
متن کاملTactical Configurations and Their Generic Ring
A construction of Tits is used to cast the argument of Kilmoyer-Solomon and Higman proving the Feit-Higman theorem in the context of tactical configurations. An analog of a result of Cvetkovic shows what combinatorial data is needed to determine the representations associated with a given configuration. The possible representations fall into three types. A bound is given for the size of certain...
متن کاملGeneralized star configurations and the Tutte polynomial
From the generating matrix of a linear code one can construct a sequence of generalized star configurations which are strongly connected to the generalized Hamming weights and the underlying matroid of the code. When the code is MDS, the matrix is generic and we obtain the usual star configurations. In our main result, we show that the degree of a generalized star configuration as a projective ...
متن کاملSymbolic Reachability Analysis of FIFO-Channel Systems with Nonregular Sets of Configurations
We address the veriication problem of FIFO-channel systems. We apply the symbolic analysis principle to these systems. We represent their sets of conngurations using structures called CQDD's combining nite-state automata with linear arith-metical constraints on number of occurrences of symbols. We show that CQDD's allow forward and backward reachability analysis of systems with nonregular sets ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Pure and Applied Algebra
سال: 2015
ISSN: 0022-4049
DOI: 10.1016/j.jpaa.2014.05.035